from projections. ” IEEE Trans Nucl Sci, 1976; NS-23: 1428-1432 [2] A.P. Dempster, N.M. Laird, D.B. Rubin “Maximum likelihood from incomplete data via
نویسندگان
چکیده
A maximum likelihood approach to emission image reconstruction from projections. Maximum likelihood from incomplete data via the EM algorithm. " A theoretical study of some maximum likelihood algorithms for emission and transmission tomography. Attenuation compensation of cone beam SPECT images using maximum likelihood reconstruction. Three-dimensional SPECT reconstruction of combined cone beam and parallel beam data. " Phys Med Biol 1992; 37: 535-548 [10] AR De Pierro. " A modified expectation maximization algorithm for penalized likelhood estimation in emission tomography, Weighted least-squares reconstruction methods for positron emission tomography. " Iterative reconstruction of PET images using a high-overrelaxation single-projection algorithm. " Phys Med Biol 1997; 42: 569-582. [13] JA Fessler. " Penalized weighted least-squares image reconstruction for positron emission tomography. Dual matrix ordered subsets reconstruction for accelerated 3D scatter compensation in single-photon emission tomog-raphy. [15] SJ Glick, EJ Soares. " Noise characteristics of SPECT iterative reconstruction with a mis-matched projector-backprojector pair. [16] DG Politte, DL Snyder. " Corrections for accidental coincidences and attenuation in maximum-likelihood image reconstruction for positron-emission tomography. " IEEE Trans Med Imaging, 1991; 10: 82-89. [17] BF Hutton, V Baccarne. " Efficient scatter modelling for incorporation in maximum likelihood reconstruction. " The use of sieves to stabilize images produced with the EM algorithm for emission tomography. Noise and edge artifacts in maximum likelihood reconstructions for emission tomography.
منابع مشابه
Maximum Likelihood Estimation of Factor Analysis Using the Ecme Algorithm with Complete and Incomplete Data
Factor analysis is a standard tool in educational testing contexts, which can be fit using the EM algorithm (Dempster, Laird and Rubin (1977)). An extension of EM, called the ECME algorithm (Liu and Rubin (1994)), can be used to obtain ML estimates more efficiently in factor analysis models. ECME has an E-step, identical to the E-step of EM, but instead of EM’s M-step, it has a sequence of CM (...
متن کاملMaximum likelihood parameter estimation from incomplete data via the sensitivity equations: the continuous-time case
This paper is concerned with maximum likelihood (ML) parameter estimation of continuous-time nonlinear partially observed stochastic systems, via the expectation maximization (EM) algorithm. It is shown that the EM algorithm can be executed efficiently, provided the unnormalized conditional density of nonlinear filtering is either explicitly solvable or numerically implemented. The methodology ...
متن کاملExpectation Maximisation for Sensor Data Fusion
The expectation maximisation algorithm (EM) was introduced by Dempster, Laird and Rubin in 1977 [DLR77]. The basic of expextation maximisation is maximum likelihood estimation (MLE). In modern sensor data fusion expectation maximisation becomes a substantial part in several applications, e.g. multi target tracking with probabilistic multi hypothesis tracking (PMHT), target extraction within pro...
متن کاملA Tutorial on the Expectation-Maximization Algorithm Including Maximum-Likelihood Estimation and EM Training of Probabilistic Context-Free Grammars
The paper gives a brief review of the expectation-maximization algorithm (Dempster, Laird, and Rubin 1977) in the comprehensible framework of discrete mathematics. In Section 2, two prominent estimation methods, the relative-frequency estimation and the maximum-likelihood estimation are presented. Section 3 is dedicated to the expectation-maximization algorithm and a simpler variant, the genera...
متن کاملLower Bounds for the Gibbs Sampler over Mixtures of Gaussians
Inferring the parameters of a mixture model based on observed data is a classical problem in machine learning that has received much attention from computer scientists and statisticians alike. One of the first computational approaches to this problem was given by Dempster, Laird, and Rubin (1977) in the form of the popular EM algorithm. The goal of their algorithm was to find the parameters whi...
متن کامل